and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))
↳ QTRS
↳ DependencyPairsProof
and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))
IMPLIES(x, false) → NOT(x)
IMPLIES(false, y) → NOT(false)
IMPLIES(not(x), not(y)) → AND(x, y)
IMPLIES(not(x), not(y)) → IMPLIES(y, and(x, y))
and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
IMPLIES(x, false) → NOT(x)
IMPLIES(false, y) → NOT(false)
IMPLIES(not(x), not(y)) → AND(x, y)
IMPLIES(not(x), not(y)) → IMPLIES(y, and(x, y))
and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
IMPLIES(not(x), not(y)) → IMPLIES(y, and(x, y))
and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
IMPLIES(not(x), not(y)) → IMPLIES(y, and(x, y))
The value of delta used in the strict ordering is 3/2.
POL(IMPLIES(x1, x2)) = (4)x_1 + (2)x_2
POL(not(x1)) = 1/4 + (4)x_1
POL(false) = 0
POL(and(x1, x2)) = x_1
and(x, false) → false
and(x, not(false)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
and(x, false) → false
and(x, not(false)) → x
not(not(x)) → x
implies(false, y) → not(false)
implies(x, false) → not(x)
implies(not(x), not(y)) → implies(y, and(x, y))